Random k -Labelsets: An Ensemble Method for Multilabel Classification
نویسندگان
چکیده
This paper proposes an ensemble method for multilabel classification. The RAndom k-labELsets (RAKEL) algorithm constructs each member of the ensemble by considering a small random subset of labels and learning a single-label classifier for the prediction of each element in the powerset of this subset. In this way, the proposed algorithm aims to take into account label correlations using single-label classifiers that are applied on subtasks with manageable number of labels and adequate number of examples per label. Experimental results on common multilabel domains involving protein, document and scene classification show that better performance can be achieved compared to popular multilabel classification approaches.
منابع مشابه
CP-RAkEL: Improving Random k-labelsets with Conformal Prediction for Multi-label Classification
Multi-label conformal prediction has attracted much attention in the conformal predictor (CP) community. In this article, we propose to combine CP with random k -labelsets (RAkEL) method, which is state-of-the-art multi-label classification method for large number of labels. In the framework of RAkEL, the original problem is reduced to a number of small-sized multi-label classification tasks by...
متن کاملCost Sensitive Ranking Support Vector Machine for Multi-label Data Learning
Multi-label data classification has become an important and active research topic, where the classification algorithm is required to deal with prediction of sets of label indicators for instances simultaneously. Label powerset (LP) method reduces the multi-label classification problem to a single-label multi-class classification problem by treating each distinct combination of labels. However, ...
متن کاملEnsemble Methods for Multi-label Classification
Ensemble methods have been shown to be an effective tool for solving multi-label classification tasks. In the RAndom k-labELsets (RAKEL) algorithm, each member of the ensemble is associated with a small randomly-selected subset of k labels. Then, a single label classifier is trained according to each combination of elements in the subset. In this paper we adopt a similar approach, however, inst...
متن کاملFeature ranking for multi-label classification using predictive clustering trees
In this work, we present a feature ranking method for multilabel data. The method is motivated by the the practically relevant multilabel applications, such as semantic annotation of images and videos, functional genomics, music and text categorization etc. We propose a feature ranking method based on random forests. Considering the success of the feature ranking using random forest in the task...
متن کاملGeneralized k-Labelsets Ensemble for Multi-Label and Cost-Sensitive Classification
Label powerset (LP) method is one category of multi-label learning algorithm. This paper presents a basis expansions model for multi-label classification, where a basis function is a LP classifier trained on a random k-labelset. The expansion coefficients are learned to minimize the global error between the prediction and the ground truth. We derive an analytic solution to learn the coefficient...
متن کامل